computability Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is clo ...

and complexity theory, ALL is the class of all

decision problem In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question of the input values. An example of a decision problem is deciding by means of an algorithm wheth ...

Relations to other classes

ALL contains all of the complex classes of decision problems, including RE and co-RE.

External links

* Complexity classes {{comp-sci-theory-stub